|
|
IPv6 Prefix Sets Generator
Utkin, Kirill ; Kučera, Jan (referee) ; Matoušek, Jiří (advisor)
Due to the fast adoption of IPv6 protocol, number of IPv6 prefixes in routing tables are incessantly increasing. Based on this fact, development of new lookup algorithms is required. However, testing of those algorithms is highly dependent on size of datasets, which are not large enough for this purpose at the moment. Design and implementation of generator of IPv6 prefix sets, which will be based on currently using address allocation policies, is the main goal of this bachelor's thesis. Implementation of generator was preceded by study and implementation of the generator V6Gene. Validation of generated datasets were performed by comparing length distribution and level distribution of prefixes with the real world datasets. Finally, speed of the generating process and memory usage were compared for implemented generators.
|
|
|
Comparison of IPv6 Prefix Set Generators
Vašek, Dominik ; Kučera, Jan (referee) ; Matoušek, Jiří (advisor)
This bachelor's thesis aims to compare the IPv6 generators. In the first part we introduce protocol IPv6 and the allocation policies of registrars in order to better understand the problem. Next, we introduce three existing prefix set generators, whose description is available. In the second part of the thesis we propose and implement a series of tests for the prefix set generators. Lastly, we test the generators and make a conclusion based on the results. According to our results, we conclude that the prefix sets from the NonRandom and IPv6Table generators have a large error in comparison with a target prefix set. However, V6Gene, the implementation of which is not currently publicly available, might generate prefix sets close to the reality based on its proposal.
|
|
|
IPv6 Prefix Sets Generator
Utkin, Kirill ; Kučera, Jan (referee) ; Matoušek, Jiří (advisor)
Due to the fast adoption of IPv6 protocol, number of IPv6 prefixes in routing tables are incessantly increasing. Based on this fact, development of new lookup algorithms is required. However, testing of those algorithms is highly dependent on size of datasets, which are not large enough for this purpose at the moment. Design and implementation of generator of IPv6 prefix sets, which will be based on currently using address allocation policies, is the main goal of this bachelor's thesis. Implementation of generator was preceded by study and implementation of the generator V6Gene. Validation of generated datasets were performed by comparing length distribution and level distribution of prefixes with the real world datasets. Finally, speed of the generating process and memory usage were compared for implemented generators.
|
|
|
Comparison of IPv6 Prefix Set Generators
Vašek, Dominik ; Kučera, Jan (referee) ; Matoušek, Jiří (advisor)
This bachelor's thesis aims to compare the IPv6 generators. In the first part we introduce protocol IPv6 and the allocation policies of registrars in order to better understand the problem. Next, we introduce three existing prefix set generators, whose description is available. In the second part of the thesis we propose and implement a series of tests for the prefix set generators. Lastly, we test the generators and make a conclusion based on the results. According to our results, we conclude that the prefix sets from the NonRandom and IPv6Table generators have a large error in comparison with a target prefix set. However, V6Gene, the implementation of which is not currently publicly available, might generate prefix sets close to the reality based on its proposal.
|
guest ::
